1

Enumerating longest increasing subsequences and patience sorting

Sergei Bespamyatnikh, Michael Segal
Journal:
Information Processing Letters
Year:
2000
Language:
english
File:
PDF, 57 KB
english, 2000
3

An O(nlogn) algorithm for the zoo-keeper's problem

Sergei Bespamyatnikh
Journal:
Computational Geometry
Year:
2003
Language:
english
File:
PDF, 484 KB
english, 2003
4

Packing two disks in a polygon

Sergei Bespamyatnikh
Journal:
Computational Geometry
Year:
2002
Language:
english
File:
PDF, 365 KB
english, 2002
5

COMPUTING CLOSEST POINTS FOR SEGMENTS

BESPAMYATNIKH, SERGEI
Journal:
International Journal of Computational Geometry & Applications
Year:
2003
Language:
english
File:
PDF, 1.89 MB
english, 2003
6

An efficient algorithm for enumeration of triangulations

Sergei Bespamyatnikh
Journal:
Computational Geometry
Year:
2002
Language:
english
File:
PDF, 294 KB
english, 2002
9

Computing homotopic shortest paths in the plane

Sergei Bespamyatnikh
Journal:
Journal of Algorithms
Year:
2003
Language:
english
File:
PDF, 412 KB
english, 2003
10

Algorithms for shortest paths and d-cycle problems

Sergei Bespamyatnikh, Andrei Kelarev
Journal:
Journal of Discrete Algorithms
Year:
2003
Language:
english
File:
PDF, 185 KB
english, 2003
13

Selecting distances in arrangements of hyperplanes spanned by points

Sergei Bespamyatnikh, Michael Segal
Journal:
Journal of Discrete Algorithms
Year:
2004
Language:
english
File:
PDF, 189 KB
english, 2004
14

Covering a set of points by two axis-parallel boxes

Sergei Bespamyatnikh, Michael Segal
Journal:
Information Processing Letters
Year:
2000
Language:
english
File:
PDF, 87 KB
english, 2000
15

Queries with segments in Voronoi diagrams

Sergei Bespamyatnikh, Jack Snoeyink
Journal:
Computational Geometry
Year:
2000
Language:
english
File:
PDF, 285 KB
english, 2000
16

AN OPTIMAL MORPHING BETWEEN POLYLINES

BESPAMYATNIKH, SERGEI
Journal:
International Journal of Computational Geometry & Applications
Year:
2002
Language:
english
File:
PDF, 1.02 MB
english, 2002